Languages in AC de ned by iterating nite transducers
نویسندگان
چکیده
We present an explicit construction of AC circuits that simulate nite state transducer iteration. Our approach yields circuits with only Θ(n log(n)) linear fan-in gates, whereas the circuits built from standard proof of L ⊆ AC use matrix multiplication and hence have Θ(n log(n)) such gates.
منابع مشابه
ON THE FUZZY DIMENSIONS OF FUZZY VECTOR SPACES
In this paper, rstly, it is proved that, for a fuzzy vector space, the set of its fuzzy bases de ned by Shi and Huang, is equivalent to the family of its bases de ned by P. Lubczonok. Secondly, for two fuzzy vector spaces, it is proved that they are isomorphic if and only if they have the same fuzzy dimension, and if their fuzzy dimensions are equal, then their dimensions are the same, however,...
متن کاملLinear Constraint Query Languages: Expressive Power and Complexity
We give an AC upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressibility of various usual queries, such as the parity of the cardinality of a set or the connectivity of a graph in rst-order logic with linear constraints.
متن کاملProperties of Quasi-Relabeling Tree Bimorphisms
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is de ned by a tree bimorphism (φ,L, ψ), where φ and ψ are quasi-relabeling tree homomorphisms and L is a regular tree language. Such relations admit a canonical representation, which immediately also yields that QUASI is closed under nite union. Howe...
متن کاملLanguage Stability and Stabilizability of Discrete Event Dynamical Systems 1
This paper studies the stability and stabilizability of Discrete Event Dynamical Systems(DEDS's) modeled by state machines. We de ne stability and stabilizability in terms of thebehavior of the DEDS's, i.e. the language generated by the state machines (SM's). Thisgeneralizes earlier work where they were de ned in terms of legal and illegal states ratherthan strings. The noti...
متن کاملInstitute for Research in Cognitive Science Finite Model Theory and Finite Variable Logics Ph
Finite Model Theory and Finite Variable Logics Eric Rosen Supervisor: Scott Weinstein In this dissertation, I investigate some questions about the model theory of nite structures. One goal is to better understand the expressive power of various logical languages, including rst-order logic (FO), over this class. A second, related, goal is to determine which results from classical model theory re...
متن کامل